SELP - A System for Studying Strong Equivalence between Logic Programs
نویسندگان
چکیده
This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given ground disjunctive logic programs are equivalent, and if not, return a counter-example. This allows us to investigate some interesting properties of strong equivalence, such as a complete characterization for a rule to be strongly equivalent to another one, and checking whether a given set of rules is strongly equivalent to another, perhaps simpler set of rules.
منابع مشابه
Strong Equivalence of Logic Programs with Abstract Constraint Atoms
Constraint Atoms Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, and Jia-Huai You 1 Aalto University, Department of Information and Computer Science {Guohua.Liu,Tomi.Janhunen,Ilkka.Niemela}@aalto.fi 2 University of Alberta, Department of Computing Science {goebel,you}@cs.ualberta.ca Abstract. Logic programs with abstract constraint atoms provide a Logic programs with abstract constraint...
متن کاملTesting Relativised Uniform Equivalence under Answer-Set Projection in the System cc⊤
The system cc⊤ is a tool for testing correspondence between logic programs under the answer-set semantics with respect to different refined notions of program correspondence. The underlying methodology of cc⊤ is to reduce a given correspondence problem to the satisfiability problem of quantified propositional logic and to employ extant solvers for the latter language as back-end inference engin...
متن کاملStrong equivalence made easy: nested expressions and weight constraints
Logic programs P and Q are strongly equivalent if, given any program R, programs P ∪R and Q ∪R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct without considering the whole program. Lifschitz, Pearce and Valverde showed that Heyting’s logic of here-an...
متن کاملTesting Relativised Uniform Equivalence under Answer-Set Projection in the System ccT
The system cc⊤ is a tool for testing correspondence between propositional logic programs under the answer-set semantics with respect to different refined notions of program correspondence. The underlying methodology of cc⊤ is to reduce a given correspondence problem to the satisfiability problem of quantified propositional logic and to employ extant solvers for the latter language as back-end i...
متن کاملccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics
In recent work, a general framework for specifying correspondences between logic programs under the answer-set semantics has been defined. The framework captures different notions of equivalence, including well-known ones like ordinary, strong, and uniform equivalence, as well as refined ones based on the projection of answer sets where not all parts of an answer set are of relevance. In this p...
متن کامل